Optimal design of electrical machines: mathematical programming formulations
نویسندگان
چکیده
منابع مشابه
Optimal Design of Electrical Machines: Mathematical Programming Formulations
The optimal design of electrical machines can be mathematically modeled as a (mixed-integer) nonlinear optimization problem. We investigate the impact of different mathematical formulations on the results obtained using a local optimization solver which is well-known in the engineering community: MatLab’s fmincon function. Our analysis is based on six different mathematically equivalent formula...
متن کاملLogical Reasoning about Programming of Mathematical Machines
We always start the solving of a problem with the formulation of its theoretical foundations. If we would like to use mathematical machines (computers) in problem solving, we need to formalize its theoretical foundations as logical reasoning because the programs should really prove the correctness of their results. In our paper we present central ideas of our approach regarding programming as l...
متن کاملeconomic optimal allocation of agriculture water: mathematical programming approach
due to increasing demand for the scarce available water throughout the world it is an extremely important matter, in water management, to make serious attempts in determining its true economic value. this paper discusses the optimal allocation of water to agriculture, the relatively true economic value of water as well as the cropping patterns for the shirvan barzo (sb) dam area in north kh...
متن کاملMathematical Programming for Data Mining: Formulations and Challenges
This paper is intended to serve as an overview of a rapidly emerging research and applications area. In addition to providing a general overview, motivating the importance of data mining problems within the area of knowledge discovery in databases, our aim is to list some of the pressing research challenges, and outline opportunities for contributions by the optimization research communities. T...
متن کاملMathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
We discuss a mixed-integer nonlinear programming formulation for the problem of covering a set of points with a given number of slabs of minimum width, known as the bottleneck variant of the hyperplane clustering problem. We derive several linear approximations, which we solve using a standard mixed-integer linear programming solver. A computational comparison of the performance of the differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering
سال: 2013
ISSN: 0332-1649
DOI: 10.1108/03321641311305863